By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
Search This Issue
Volume 8, Issue 2, pp. 155-345

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Preserving and Increasing Local Edge-Connectivity in Mixed Graphs

JØrgen Bang-Jensen, András Frank, and Bill Jackson

pp. 155-178

BibTeX  Abstract Full Text:  PDF

Competition Graphs of Strongly Connected and Hamiltonian Digraphs

Kathryn F. Fraughnaugh, J. Richard Lundgren, Sarah K. Merz, John S. Maybee, and Norman J. Pullman

pp. 179-185

BibTeX  Abstract Full Text:  PDF

A Competitive Strong Spanning Tree Algorithm for the Maximum Bipartite Matching Problem

Jaime González and Osvaldo Landaeta

pp. 186-195

BibTeX  Abstract Full Text:  PDF

Bounds for Binary Codes that are Multiple Coverings of the Farthest-Off Points

Heikki O. Hämäläinen, Iiro S. Honkala, Simon N. Litsyn, and Patric R. J. Östergård

pp. 196-207

BibTeX  Abstract Full Text:  PDF

The Existence of Homomorphisms to Oriented Cycles

Pavol Hell and Xuding Zhu

pp. 208-222

BibTeX  Abstract Full Text:  PDF

Chernoff–Hoeffding Bounds for Applications with Limited Independence

Jeanette P. Schmidt, Alan Siegel, and Aravind Srinivasan

pp. 223-250

BibTeX  Abstract Full Text:  PDF

Nonredundant 1's in $\Gamma $-Free Matrices

Jeremy P. Spinrad

pp. 251-257

BibTeX  Abstract Full Text:  PDF

Sliceable Floorplanning by Graph Dualization

Gary K. H. Yeap and Majid Sarrafzadeh

pp. 258-280

BibTeX  Abstract Full Text:  PDF

Two-Way Rounding

Donald E. Knuth

pp. 281-290

BibTeX  Abstract Full Text:  PDF

Degree-Constrained Network Spanners with Nonconstant Delay

Arthur L. Liestman and Thomas C. Shermer

pp. 291-321

BibTeX  Abstract Full Text:  PDF

Analysis of a Recurrence Arising from a Construction for Nonblocking Networks

Nicholas Pippenger

pp. 322-345

BibTeX  Abstract Full Text:  PDF